Approximate Saddle Points Portfolios
نویسنده
چکیده
We introduce the concept of saddle points portfolio and we establish a connection between this concept and the approximate minima.
منابع مشابه
Subgradient Methods for Saddle-Point Problems
We consider computing the saddle points of a convex-concave function using subgradient methods. The existing literature on finding saddle points has mainly focused on establishing convergence properties of the generated iterates under some restrictive assumptions. In this paper, we propose a subgradient algorithm for generating approximate saddle points and provide per-iteration convergence rat...
متن کاملGradient Descent Can Take Exponential Time to Escape Saddle Points
Although gradient descent (GD) almost always escapes saddle points asymptotically [Lee et al., 2016], this paper shows that even with fairly natural random initialization schemes and non-pathological functions, GD can be significantly slowed down by saddle points, taking exponential time to escape. On the other hand, gradient descent with perturbations [Ge et al., 2015, Jin et al., 2017] is not...
متن کاملComparison of methods for finding saddle points without knowledge of the final states.
Within the harmonic approximation to transition state theory, the biggest challenge involved in finding the mechanism or rate of transitions is the location of the relevant saddle points on the multidimensional potential energy surface. The saddle point search is particularly challenging when the final state of the transition is not specified. In this article we report on a comparison of severa...
متن کاملSelf-dual smoothing of convex and saddle functions
It is shown that any convex function can be approximated by a family of differentiable with Lipschitz continuous gradient and strongly convex approximates in a “self-dual” way: the conjugate of each approximate is the approximate of the conjugate of the original function. The approximation technique extends to saddle functions, and is self-dual with respect to saddle function conjugacy and also...
متن کاملThe curvature of the conical intersection seam: an approximate second-order analysis.
We present a method for analyzing the curvature (second derivatives) of the conical intersection hyperline at an optimized critical point. Our method uses the projected Hessians of the degenerate states after elimination of the two branching space coordinates, and is equivalent to a frequency calculation on a single Born-Oppenheimer potential-energy surface. Based on the projected Hessians, we ...
متن کامل